Graphs with scale-free degree sequence
نویسندگان
چکیده
What distribution of graphical degree sequence is invariant under “scaling”? Are these graphs always power-law graphs? We show the answer is a surprising “yes” for sparse graphs if we ignore isolated vertices, or more generally, the vertices with degrees less than a fixed constant k. We obtain a concentration result on the degree sequence of a random induced subgraph. The case of hypergraphs (or set-systems) is also examined.
منابع مشابه
The degree sequences and spectra of scale-free random graphs
We investigate the degree sequences of scale-free random graphs. We obtain a formula for the limiting proportion of vertices with degree d, confirming non-rigorous arguments of Dorogovtsev et al [10]. We also consider a generalisation of the model with more randomisation, proving similar results. Finally, we use our results on the degree sequence to show that for certain values of parameters lo...
متن کاملTowards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
There is a large, popular, and growing literature on “scale-free networks” with the Internet along with metabolic networks representing perhaps the canonical examples. While this has in many ways reinvigorated graph theory, there is unfortunately no consistent, precise definition of scale-free graphs and few rigorous proofs of many of their claimed properties. In fact, it is easily shown that t...
متن کاملParameterized Clique on Scale-Free Networks
Finding cliques in graphs is a classical problem which is in general NP-hard and parameterized intractable. However, in typical applications like social networks or protein-protein interaction networks, the considered graphs are scale-free, i.e., their degree sequence follows a power law. Their specific structure can be algorithmically exploited and makes it possible to solve clique much more e...
متن کاملOn the Synchronization of Networks with Prescribed Degree Distributions
We show that the degree distributions of graphs do not suffice to characterize the synchronization of systems evolving on them. We prove that, for any given degree sequence satisfying certain conditions, a connected graph having that degree sequence exists for which the first nontrivial eigenvalue of the graph Laplacian is arbitrarily close to zero. Consequently, dynamical systems defined on su...
متن کاملDISTINGUISHING VERTICES OF INHOMOGENEOUS RANDOM GRAPHS By
We explore under what conditions simple combinatorial attributes and algorithms such as the distance sequence and degree-based partitioning and refinement can be used to distinguish vertices of inhomogeneous random graphs. In the classical setting of Erdős-Renyi graphs and random regular graphs it has been proven that vertices can be distinguished in a constant number of rounds of degree-based ...
متن کامل